a=list(map(str,input().split()))
t=[0]*len(a)
str=["lios","liala","etr","etra","initis","inites"]
if len(a)==1:
for i in range(6):
if a[0].endswith(str[i]):
print("YES")
exit(0)
print("NO")
exit(0)
for i in range(len(a)):
for j in range(6):
if a[i].endswith(str[j]):
t[i]=j+1
break
if t[i]==0:
print("NO")
exit(0)
rem=t[0]%2
for i in range(len(t)):
if t[i]%2!=rem:
print("NO")
exit(0)
x=sorted(t)
cnt=0
for i in range(len(t)):
if t[i]==3 or t[i]==4:
cnt+=1
if t[i]!=x[i]:
print("NO")
exit(0)
if cnt==1:
print("YES")
else:
print("NO")120. Triangle | 102. Binary Tree Level Order Traversal |
96. Unique Binary Search Trees | 75. Sort Colors |
74. Search a 2D Matrix | 71. Simplify Path |
62. Unique Paths | 50. Pow(x, n) |
43. Multiply Strings | 34. Find First and Last Position of Element in Sorted Array |
33. Search in Rotated Sorted Array | 17. Letter Combinations of a Phone Number |
5. Longest Palindromic Substring | 3. Longest Substring Without Repeating Characters |
1312. Minimum Insertion Steps to Make a String Palindrome | 1092. Shortest Common Supersequence |
1044. Longest Duplicate Substring | 1032. Stream of Characters |
987. Vertical Order Traversal of a Binary Tree | 952. Largest Component Size by Common Factor |
212. Word Search II | 174. Dungeon Game |
127. Word Ladder | 123. Best Time to Buy and Sell Stock III |
85. Maximal Rectangle | 84. Largest Rectangle in Histogram |
60. Permutation Sequence | 42. Trapping Rain Water |
32. Longest Valid Parentheses | Cutting a material |